Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion
نویسندگان
چکیده
This paper presents a differential evolution algorithm to solve the permutaion flowshop sequencing problem with makespan criterion. Differential evolution is one of the latest evolutionary optmization algorithm applied to continuous optimization problems where members of population use chromosomes based on floating-point numbers to represent candidate solutions. In this paper we also present a heuristic rule, called smallest parameter value first in the permutation, which enables the differential evolution algorithm to be applied to all classes of sequencing scheduling problems. The results for the well known benchmark suite in the literature is presented and compared to the well known approaches such as genetic algorithm and partical swarm optimization algorithm.
منابع مشابه
Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملParticle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark sui...
متن کاملA Discrete Differential Evolution Algorithm for Multi-Objective Permutation Flowshop Scheduling
Real-world versions of the permutation flowshop scheduling problem (PFSP) have a variety of objective criteria to be optimized simultaneously. Multi-objective PFSP is also a relevant combinatorial multi-objective optimization problem. In this paper we propose a multiobjective evolutionary algorithm for PFSPs by extending the previously proposed discrete differential evolution scheme for single-...
متن کاملAn improved artificial bee colony algorithm for the blocking flowshop scheduling problem
This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obt...
متن کاملIntegrative Cooperative Approach for Solving Permutation Flowshop Scheduling Problem with Sequence Dependent Family Setup Times
This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the ap...
متن کامل